package leetcode;

import java.util.Arrays;

//打家劫舍二
public class LC213 {

    public int rob(int[] nums) {
        if (nums.length <= 2) return Math.max(nums[0],nums[nums.length - 1]);
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] =  Math.max(nums[0],nums[1]);

        for (int i = 2; i < nums.length - 1; i++) {
            dp[i] = Math.max(dp[i  - 2] + nums[i],dp[i-1]);
        }
        int ans = dp[nums.length - 2];
        Arrays.fill(dp,0);
        dp[0] = 0;
        dp[1] = nums[1];
        for (int i = 2; i < nums.length; i++) {
            dp[i] = Math.max(dp[i-2] + nums[i], dp[i-1]);
        }
        return Math.max(ans,dp[nums.length - 1]);
    }
}
